An algorithm to generate high dense packing of particles with various shapes
نویسندگان
چکیده
منابع مشابه
Fractal Properties of Dense Packing of Spherical Particles
Two computer models were developed to realize the algorithms of random Apollonian and Apollonian packings of the spherical particles in a unit cube. A genetic algorithm was developed for the latter packing model. The upper and lower bounds of a fractal dimension were computed using various numerical methods. It was observed that for both models the fractal properties were not essentially affect...
متن کاملDeposition of Various Shapes Particles on a Rough Surface in Turbulent Flow
An experiment set-up is used to study wall deposition rate of particles on a rough surface in a turbulent channel flow. Deposition velocities for three classes of particles, namely, spherical glass particles, irregular shape polymer particles, and fibrous silicon particles are studied. The particle concentration at the test section was measured with the aid of an isokinetic probe in conjunction...
متن کاملA Versatile Algorithm to Generate Various Combinatorial Structures
Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl [24] that generates all unique permutations of a list of elements which possibly contains repetitions, taking some or all of the elements at a time, in any imposed order. The algorithm uses an auxiliary array that maintains th...
متن کاملAn optimal algorithm to generate tilings
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as input. We first recall some useful results, namely the distributive lattice structure of the space of tilings and Thurston’s algorithm for constructing a particular tiling. We then describe our algorithm and study its...
متن کاملAn Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs
First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2018
ISSN: 2261-236X
DOI: 10.1051/matecconf/201821905004